Doubly Circular Linked List - Insert node to a specific position.cpp

#include <iostream>
using namespace std;

struct NODE {
    int data;
    NODE *prev;
    NODE *next;
};

NODE *head, *tail, *prevnode, *temp;
void add(int value){
    if(head == NULL){
        head = tail = new NODE;
        head->data = value;
        head->prev = head->next = tail;
    } else {
        prevnode = tail;
        tail->next = head->prev = new NODE;
        tail = tail->next;
        tail->prev = prevnode;
        tail->data = value;
        tail->next = head;
    }
}

void addTo(int position, int value){
    temp = head;
    if(position >= 1){    
        for(int i = 1; i < position-1; i++){
            temp = temp->next; // point to position immediate previous node
            if(temp == head){
                temp = 0;
                break; 
            }
        }
        if(temp || position == 1){
            NODE *newnode = new NODE;
            newnode->data = value;
            if(position == 1){
                head->prev = newnode;
                newnode->next = head;
                head = newnode;
                if(head->next == 0) tail = head;
                tail->next = head;
                head->prev = tail;
            } else {
                newnode->prev = temp;
                newnode->next = temp->next;
                temp->next = newnode;
                if(newnode->next == head){
                    tail = head->prev = newnode;
                    tail->next = head;
                } else {
                    newnode->next->prev = newnode;
                }
            }
        }
    }
    if(position < 1 || temp == 0){
        cout << "Data not inserted. Invalid position [" << position <<"]." << endl;
    }
}

int print(NODE *ref){
    if(ref == 0){
        cout << "[EMPTY LIST]" << endl;
        return false;
    } else {
        do {
            cout << ref->data;
            ref = ref->next;
            if(ref != head) cout << " => ";
        } while(ref != head);
        cout << endl;
        return true;
    }
}

int main(){
    add(10);
    add(20);
    add(30);
    addTo(1, 5);
    addTo(3, 15);
    addTo(6, 35);
    print(head);
}